김지수: 최고의 집합 #266

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

soojik wants to merge 1 commit into Coding-Test-Study-Group:main from soojik:soojik_최고의집합

Contributor

soojik commented Aug 28, 2023

📖 풀이한 문제

프로그래머스 - 최고의 집합

💡 문제에서 사용된 알고리즘

수학

📜 코드 설명

곱이 최대가 되려면 수들이 공평하게 최대로 커야하므로 n만큼의 몫을 먼저 나누고, n개의 원소 중 나머지만큼에 각 1씩 더해준다.

close #265


          김지수: 최고의 집합

2daadad

soojik added this to the 8월 5주차 milestone

soojik requested review from j2woo and SollyJ

August 28, 2023 17:57

soojik requested a review from a team as a code owner

August 28, 2023 17:57

soojik self-assigned this

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet